e-clean matrices and unit-regular matrices
نویسندگان
چکیده
let a; b; k 2 k and u ; v 2 u(k). we show for any idempotent e 2 k, ( a 0 b 0 ) is e-clean i ( a 0 u(vb + ka) 0 ) is e-clean and if ( a 0 b 0 ) is 0-clean, ( ua 0 u(vb + ka) 0 ) is too.
منابع مشابه
E-Clean Matrices and Unit-Regular Matrices
Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.
متن کاملGENERALIZED REGULAR FUZZY MATRICES
In this paper, the concept of k-regular fuzzy matrix as a general- ization of regular matrix is introduced and some basic properties of a k-regular fuzzy matrix are derived. This leads to the characterization of a matrix for which the regularity index and the index are identical. Further the relation between regular, k-regular and regularity of powers of fuzzy matrices are dis- cussed.
متن کاملNil-clean Companion Matrices
The classes of clean and nil-clean rings are closed with respect standard constructions as direct products and (triangular) matrix rings, cf. [12] resp. [4], while the classes of weakly (nil-)clean rings are not closed under these constructions. Moreover, while all matrix rings over fields are clean, [12] when we consider nil-clean rings there are strongly restrictions: if a matrix ring over a ...
متن کاملgeneralized regular fuzzy matrices
in this paper, the concept of k-regular fuzzy matrix as a general- ization of regular matrix is introduced and some basic properties of a k-regular fuzzy matrix are derived. this leads to the characterization of a matrix for which the regularity index and the index are identical. further the relation between regular, k-regular and regularity of powers of fuzzy matrices are dis- cussed.
متن کاملRegular, pseudo-regular, and almost regular matrices
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we introduce regular, pseudo-regular, and almost regular matrices. Nonnegative, symmetric, almost regular matrices were studied earlier by Ho¤man, Wolfe, and Ho¤...
متن کاملMatrices Satisfying Regular Minimality
A matrix of discrimination measures (discrimination probabilities, numerical estimates of dissimilarity, etc.) satisfies Regular Minimality (RM) if every row and every column of the matrix contains a single minimal entry, and an entry minimal in its row is minimal in its column. We derive a formula for the proportion of RM-compliant matrices among all square matrices of a given size and with no...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of linear and topological algebra (jlta)جلد ۱، شماره ۰۲، صفحات ۱۱۵-۱۱۸
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023